Restart Tableaux with Selection Function
نویسندگان
چکیده
Recently, several diierent sound and complete tableau cal-culi were introduced, all sharing the idea to use a selection function and so-called restart clauses: A-ordered tableaux, tableaux with selection function, and strict restart model elimination. We present two new sound and complete abstract tableau calculi which generalize these on the ground level. This makes diierences and similarities between the calculi clearer and, in addition, gives insight into how properties of the calculi can be transferred among them. In particular, a precise borderline separating proof connuent from non-proof connuent variants is exhibited.
منابع مشابه
Calculi for Disjunctive Logic Programming
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result ...
متن کاملAn Abstract Framework for Satisfiability Modulo Theories
DPLL Modulo Theories Works with any DPLL engine and T -solver but is best with 1. an on-line DPLL engine and 2. an incremental T -solver Tableaux 2007 – p.29/40 Abstract DPLL Modulo TheoriesDPLL Modulo Theories Works with any DPLL engine and T -solver but is best with 1. an on-line DPLL engine and 2. an incremental T -solver It consists of the following rules: Propagate, Decide, Fail, Restart (...
متن کاملDisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover
In this paper, we describe a disjunctive logic programming system, referred to as Dis-LoP, based on PROTEIN theorem prover. PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs. In particular, restart model elimination calculus is answer complete for postive queries. The Dis...
متن کاملOrdered Tableaux: Extensions and Applications
In this paper several conceptual extensions to the theory of order-restricted free variable clausal tableaux which was initiated in 9, 8] are presented: atom orderings are replaced by the more general concept of a selection function, the substitutivity condition required for lifting is for certain variants of the calculus replaced by a much weaker assumption, and a rst version of order-restrict...
متن کاملRestart Strategy Selection Using Machine Learning Techniques
Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance can enhance the performance of a solver. Inspired by recent success applying machine learning techniques to predict the runtime of SAT solvers, we present a method which uses machine learning to boost solver performance through...
متن کامل